System and method for implementing adaptive load sharing to balance network traffic

ABSTRACT

A method for implementing adaptive load sharing to balance network traffic. The method begins by identifying all paths in a network between a first provider edge and a second provider edge. Next determining jitter, packet delay, and packet loss for each identified path in the network. Then utilizing the jitter, packet delay, and packet loss values, calculating a usage value for each path in the network. The usage value corresponds to the percentage of all network traffic which a specific path in the network may manage. When data is received by the first provider edge, the provider edge selects the appropriate path for the data. The appropriate path being the path with the largest usage value which is currently not managing a percentage of the network traffic that is equal to its usage value.

BACKGROUND OF THE INVENTION

The present invention relates generally to network load balancing and more particularly to implementing adaptive load sharing to balance network traffic.

Servers supporting mission-critical applications (i.e. financial transactions, database access, corporate intranets, etc.) must exchange traffic across data networks. Moreover, Additional time sensitive applications (i.e. Voice over IP, Video) need to be carried across networks. Additionally, networks need the ability to scale performance to handle large numbers of end user requests without creating unwanted delays.

Network load balancing distributes traffic to multiple paths inside the network, each path going across different network equipments (routers). Network load balancing transparently partitions the end user requests among the network paths.

Conventionally, the network routing protocols send traffic according to the shortest path between the end user and the application. Usually, the shortest path is determined based on static criteria such as least number of intermediate devices in the path (less hops), or larger capacity links (in terms of bandwidth). As the number of end users utilizing an application increases, the shortest path becomes congested leading to delays, jitters, and eventually packet loss, while they may exist alternate paths (less preferred) which are not congested.

SUMMARY OF THE INVENTION

The present invention provides a method for implementing adaptive load sharing to balance network traffic, said method comprising: identifying paths P_(i) across said network for i=1, 2, . . . , I, each path P_(i) beginning at a first provider edge and ending at a second provider edge, both said first provider edge and said second provider edge residing in a network, said index I being a total number of paths in said network and being a positive integer greater than 1;

identifying jitter J_(i) for i=1, 2, . . . , I where J_(i) corresponds to jitter on path P_(i), said jitter Ji being a measurement of time;

identifying packet delay D_(i) for i=1, 2, . . . , I where D_(i) is a packet delay on path P_(i), said packet delay Di being a measurement of time;

identifying packet loss L_(i) for i=1, 2, . . . , I where L_(i) is a packet loss on path P_(i), said packet loss Li being an integer having a value greater than zero;

calculating path usage U_(i) for i=1, 2, . . . , I where U_(i) is a maximum percentage of network traffic path P_(i) may transmit, said U_(i) being a function of said J_(i) and said D_(i) and said L_(i); and

sending data received by said first provider edge to said second provider edge via path P_(i) where path P_(i) has both a largest path usage U_(i) value selected from U₁, U₂, . . . , U_(I) and said path P_(i) does not already transmit a percentage of network traffic equal to said U_(i).

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an environment in which a method for implementing adaptive load sharing to balance network traffic may be implemented, in accordance with embodiments of the present invention.

FIG. 2 illustrates a method for implementing adaptive load sharing to balance network traffic, in accordance with embodiments of the present invention.

FIG. 3 illustrates a computer system which may facilitate a method for implementing adaptive load sharing to balance network traffic, in accordance with embodiments of the present invention.

DETAILED DESCRIPTION OF THE DRAWINGS Definitions

The term ‘provider edge’ as used herein refers to a network hardware device situated between one network service provider's area and areas administered by other network providers.

The term ‘jitter’ as used herein refers to unwanted variation of one or more characteristics of a periodic signal in electronics and telecommunications. Jitter may be seen in characteristics such as the interval between successive pulses, or the amplitude, frequency, or phase of successive cycles.

The term ‘packet loss’ as used herein refers to the situation where one or more packets of data traveling across a computer network fail to reach their destination. Packet loss can be caused by a number of factors, including signal degradation over the network medium, oversaturated network links, corrupted packets rejected in-transit, faulty networking hardware, maligned system drivers or network applications, or normal routing routines.

The term ‘packet delay’ and/or ‘latency’ as used herein refers to the period of time necessary for a packet of data to travel from one designated point to another. One-way Latency is measured by sending a packet of data across the network and by comparing the time the packet was sent with the time the packet was received, assuming both sending and receiving devices have their clock synchronized using a Network Time Protocol.

Specification

Although certain embodiments of the present invention are described herein, it is understood that modifications may be made to the present invention without departing from its course and scope. Scope of the present invention is not limited to the number of constituting components, the materials thereof, the shapes thereof, the relative arrangement thereof, etc. Furthermore, while the accompanying drawings illustrate certain embodiments of the present invention, such drawings are not necessarily depicted to scale.

FIG. 1 illustrates an environment 100 in which a method for implementing adaptive load sharing to balance network traffic may be implemented, in accordance with embodiments of the present invention.

The environment 100 comprises a first network 102 connected to both a second network 104 and a third network 106. The first network 102 comprises a first provider edge (PE1) 108 connecting the first network 102 with the second network 104. The first network 102 also comprises a second provider edge (PE2) 110 connecting the first network 102 with the third network 106. It is understood that while FIG. 1 illustrates the first network 102 comprises two provider edges (PE1 108 and PE2 110), the first network 102 may comprise a number of provider edges ranging from one to infinity.

Moreover, the first network 102 comprises a plurality of network hardware devices 112 through 124 interconnected via transmission paths 126, the transmission paths being, inter alia, Ethernet cables, fiber optic cables, radio-wave signals, satellite signals, etc.

Between the first provider edge 108 and the second provider edge 110, there are a plurality of paths upon which information may be sent. For example, with respect to FIG. 1, one path from PE1 108 to PE2 110 may travel along devices A 112, B 114, and C 116. An alternative path from PE1 108 to PE2 110 may be through devices D 118, E 120, F 122, and G 124. A second alternative path from PE1 108 to PE2 110 may be through devices D 118, A 112, B 114, F 122, G 124, and C 116.

Each path from PE1 108 to PE2 110 will have its own values for jitter, packet loss, and packet delay. While conventional network load sharing simply look to the shortest path (i.e. least amount of hardware) between PE1 108 and PE2 110, as this ‘shortest’ path receives all the traffic, this ‘shortest path’ may experience jitter, packet loss, and packet delay.

FIG. 2 illustrates a method 200 for implementing adaptive load sharing to balance network traffic, in accordance with embodiments of the present invention.

The method 200 begins with step 202 which comprises identifying all paths from the first provider edge PE1 108 to the second provider edge PE2 110 (see FIG. 1, supra). In one embodiment of the present invention each path is represented as P_(i) indexed from i=1 to i=I, where I is a positive number greater than 1 and equal to the total number of paths from the first provider edge PE1 108 to the second provider edge PE2 110. Once each path from the first provider edge PE1 108 to the second provider edge PE2 110 are identified, the first provider edge PE1 108 stores P_(i) for i=1, 2, . . . , I in a library residing within the first provider edge PE1 108.

After completion of step 202, the method 200 continues with step 204 which comprises testing each path P_(i) for packet delay, packet loss, and jitter. In one embodiment of the present invention, the first provider edge PE1 108 sends artificial data through the first network 102 to the second provider edge PE2 110 according to each P_(i) for i=1, 2, . . . , I. For each P_(i), the first provider edge PE1 108 records the packet delay D_(i) in terms of milliseconds; the jitter J_(i) in terms of milliseconds; and the packet loss L_(i) in terms of losses per ten million (10 mm). Thereinafter, the first provider edge PE1 108 stores D_(i), J_(i), and L_(i) in the library.

After completion of step 204, the method 200 continues with step 206 which comprises calculating path usage from the first provider edge PE1 108 to the second provider edge PE2 110.

In one embodiment of the present invention, prior to step 204 an end user provides the first provider edge PE1 108 with three variables: a delay ratio (DN); a jitter ratio (JN); and a loss ratio (LN). In an alternative embodiment of the present invention, the variables DN, JN, and LN are stored in the first provider edge PE1 108 prior to the start of the method 200. However, regardless of the embodiment of the present invention, all three variables DN, JN, and LN are integers having a value between zero (0) and one thousand twenty four (1024).

In one embodiment of the present invention, step 206 first calculates an intermediate value called the path rate R_(i) for i=1, 2, . . . , I. The path rate R_(i) is calculated utilizing D_(i), J_(i), and L_(i) as well as DN, JN, and LN. Specifically, R_(i) is calculated according to the function R_(i)=D_(i)*DN+J_(i)*JN+L_(g)*LN for i=1, 2, . . . , I. After calculating R_(i) for i=1, 2, . . . , I, step 206 calculates the weight per path W_(i) for i=1, 2, . . . , I.

The weight per path W_(i) is calculated according to the function

$W_{i} = \frac{R_{i}}{\sum\limits_{i = 2}^{I}R_{i}}$

for i=1, 2, . . . , I. After calculating the weight per path W_(i), step 206 calculates the credit per path C_(i) for i=1, 2, . . . , I. The credit per path C_(i) is calculated according to the function

$C_{i} = {\frac{1}{w_{i}}.}$

Finally after calculating the credit per path C_(i), step 206 calculates the path usage Ui for i=1, 2, . . . , I.

The path usage U_(i) utilizes the path rate R_(i), weight per path W_(i), and credit per path C_(i) and the resulting value derived will be used by the first provider edge PE1 108 to apportion the amount of traffic each path P_(i) can reasonably manage.

In one embodiment of the present invention path usage U_(i) is calculated according to the function

$U_{i} = \frac{c_{i}}{\sum\limits_{i = 2}^{I}c_{i}}$

for i=1, 2, . . . , I. The resulting path usage U_(i) is a fraction representing the percentage of total network traffic which a give path P_(i) can manage. After path usage U_(i) is calculated for i=1, 2, . . . , I, step 206 stores the path usage U_(i) results in a library managed by the first provider edge PE1 108.

After completion of step 206, the method 200 continues with step 208 which comprises sending data to the second provider edge PE2 110 according to the calculated path usage U_(i) values. In one embodiment of the present invention, when receiving data originating from the second network 104, the first provider edge PE1 108 will look to the path usage values U_(i) for i=1, 2, . . . , I for the most appropriate path P_(i) to transmit the data across. As noted supra, the path usage values U_(i) represent the percentage of the network traffic a specific path P_(i) can handle/manage effectively.

In one embodiment of the present invention, step 208 identifies the path usage value U_(i) having the largest value not exceeding the current network traffic. For example, say only three paths exist in the first network 102 (see FIG. 1, supra) P₁, P₂ and P₃ each having a calculated path usage value of U₁=0.30, U₂=0.20, and U₃=0.50. Since based on path usage values P₃ can handle/manage more network traffic than P₁ and P₂, step 208 would attempt to send the recently received data to the second provider edge PE2 110 via path P₃. Step 208 would also determine if sending the recently received data across the first network 102 via path P₃ would translate into P₃ managing more than 50% of the overall network traffic (the maximum value P₃ may handle based on U₃). If P₃ would end up managing more than 50% of the network traffic as a result of routing the received data, step 208 identifies the next largest path usage value after U₃. Since U₁=0.30 is greater than U₂=0.20, step 208 would transmit the received data to the second provider edge PE2 110 via path P₁.

In one embodiment of the present invention, step 208 is completed after a period of time established by the end user. In an alternative embodiment of the present invention, step 208 is completed after a pre-defined period of time, the period not being established by the end user. In another alternative embodiment of the present invention, step 208 is completed after a specific number of paths have been exhausted, the specific number being provided by the end user

After completion of step 208, the method 200 continues with step 210 which comprises determining whether to recalculate all network paths. In one embodiment of the present invention, step 210 identifies whether data is received by the first provider edge PE1 108 requiring transmission to the second provider edge PE2 110. If the first provider edge PE2 108 continues to receive data, step 210 returns a response of ‘yes’ and the method 200 returns to step 204 to perform steps 204 through 210 again. However, if the first provider edge PE2 108 does not continue to receive data, step 210 returns a response of ‘no’ and the method 200 ends.

In an alternative embodiment of the present invention, step 210 identifies whether data is currently being transmitted across the first network 102. If data is actively/currently being transmitted across the first network 102, step 210 returns a response of ‘yes’ and the method 200 returns to step 204 to perform steps 204 through 210 again. However, if no data is actively/currently being transmitted across the first network 102, step 210 returns a response of ‘no’ and the method 200 ends.

In one embodiment of the present invention, the method 200 is applied specifically to a multiprotocol label switching network, or MPLS. The MPLS network comprises provider edges (PEs) as well as provider routers (Ps). Furthermore the MPLS comprises, inter alia, a control plane and a data plane.

The control plane in turn comprises routing protocols (i.e. label discovery protocol or LDP; interior gateway protocol or IGP, etc.); a label information base (LIB) which contains label switched paths (LSPs); and a generic internet protocol service level agreement (IP SLA) engine to measure latency, jitter, and packet loss across the LSP.

The data plane utilizes the result of the control plane's calculations and IP SLA measurements to load balance traffic from the incoming provider edge (PE) to the outgoing provider edge (PE) across the multiple LSP.

FIG. 3 illustrates a computer system 900 which may facilitate a method for implementing adaptive load sharing to balance network traffic, in accordance with embodiments of the present invention.

The computer system 900 comprises a processor 908, an input device 906 coupled to the processor 908, an output device 910 coupled to the processor 908, and memory devices 902 and 912 each coupled to the processor 908.

The input device 906 may be, inter alia, a keyboard, a mouse, a keypad, a touchscreen, a voice recognition device, a sensor, a network interface card (NIC), a Voice/video over Internet Protocol (VOIP) adapter, a wireless adapter, a telephone adapter, a dedicated circuit adapter, etc.

The output device 910 may be, inter alia, a printer, a plotter, a computer screen, a magnetic tape, a removable hard disk, a floppy disk, a NIC, a VOIP adapter, a wireless adapter, a telephone adapter, a dedicated circuit adapter, an audio and/or visual signal generator, a light emitting diode (LED), etc.

The memory devices 902 and 912 may be, inter alia, a cache, a dynamic random access memory (DRAM), a read-only memory (ROM), a hard disk, a floppy disk, a magnetic tape, an optical storage such as a compact disc (CD) or a digital video disc (DVD), etc. The memory device 912 includes a computer code 914 which is a computer program that comprises computer-executable instructions.

The computer code 914 includes, inter alia, an algorithm used for implementing adaptive load sharing to balance network traffic according to the present invention. The processor 908 executes the computer code 914. The memory device 902 includes input data 904. The input data 904 includes input required by the computer code 914. The output device 910 displays output from the computer code 914. Either or both memory devices 902 and 912 (or one or more additional memory devices not shown in FIG. 3) may be used as a computer usable medium (or a computer readable medium or a program storage device) having a computer readable program embodied therein and/or having other data stored therein, wherein the computer readable program comprises the computer code 914. Generally, a computer program product (or, alternatively, an article of manufacture) of the computer system 900 may comprise said computer usable medium (or said program storage device).

Any of the components of the present invention can be deployed, managed, serviced, etc. by a service provider that offers to deploy or integrate computing infrastructure with respect to a process for implementing adaptive load sharing to balance network traffic. Thus, the present invention discloses a process for supporting computer infrastructure, comprising integrating, hosting, maintaining and deploying computer-readable code into a computing system (e.g., computing system 900), wherein the code in combination with the computing system is capable of performing a method for implementing adaptive load sharing to balance network traffic.

In another embodiment, the invention provides a business method that performs the process steps of the invention on a subscription, advertising and/or fee basis. That is, a service provider, such as a Solution Integrator, can offer to create, maintain, support, etc. a process for implementing adaptive load sharing to balance network traffic. In this case, the service provider can create, maintain, support, etc. a computer infrastructure that performs the process steps of the invention for one or more customers. In return, the service provider can receive payment from the customer(s) under a subscription and/or fee agreement, and/or the service provider can receive payment from the sale of advertising content to one or more third parties.

While FIG. 3 shows the computer system 900 as a particular configuration of hardware and software, any configuration of hardware and software, as would be known to a person of ordinary skill in the art, may be utilized for the purposes stated supra in conjunction with the particular computer system 900 of FIG. 3. For example, the memory devices 902 and 912 may be portions of a single memory device rather than separate memory devices. In addition, in one embodiment of the present invention the computer system 900 may resemble a network router (i.e. provider edge router) and facilitate a method for implementing adaptive load sharing to balance network traffic.

While particular embodiments of the present invention have been described herein for purposes of illustration, many modifications and changes will become apparent to those skilled in the art. Accordingly, the appended claims are intended to encompass all such modifications and changes as fall within the true spirit and scope of this invention. 

1. A method for implementing adaptive load sharing to balance network traffic, said method comprising: identifying paths P_(i) for i=1, 2, . . . , I, each path P_(i) beginning at a first provider edge and ending at a second provider edge, both said first provider edge and said second provider edge residing in a network, said index I being a total number of paths in said network and being a positive integer greater than 1; identifying jitter J_(i) for i=1, 2, . . . , I where J_(i) corresponds to jitter on path P_(i), said jitter Ji being a measurement of time; identifying packet delay D_(i) for i=1, 2, . . . , I where D_(i) is a packet delay on path P_(i), said packet delay Di being a measurement of time; identifying packet loss L_(i) for i=1, 2, . . . , I where L_(i) is a packet loss on path P_(i), said packet loss Li being an integer having a value greater than zero; calculating path usage U_(i) for i=1, 2, . . . , I where U_(i) is a maximum percentage of network traffic path P_(i) may transmit, said U_(i) being a function of said J_(i) and said D_(i) and said L_(i); and sending data received by said first provider edge to said second provider edge via path P_(i) where path P_(i) has both a largest path usage U_(i) value selected from U₁, U₂, . . . , U_(I) and said path P_(i) does not already transmit a percentage of network traffic equal to said U_(i).
 2. The method of claim 1, said method further comprising: repeating said identifying said packet delay D_(i) for i=1, 2, . . . , I and said identifying said jitter J_(i) for i=1, 2, . . . , I and said identifying said packet loss L_(i) for i=1, 2, . . . , I and said calculating said path usage U_(i) for i=1, 2, . . . , I, after a period of time having elapsed.
 3. The method of claim 1, said calculating said path usage U_(i) comprising: calculating a path rate R_(i) according to a function R_(i)=D_(i)*DN+J_(i)*JN+L_(g)*LN for i=1, 2, . . . , I, said DN being a delay ratio and being an integer having a value greater than 1, said JN being a jitter ratio and being an integer having a value greater than 1, said LN being a packet loss ratio per ten million packets and being an integer having a value greater than 1, said DN and said JN and said LN being provided by an end user prior to said calculating said path usage U_(i), and calculating said path usage U_(i) according to a function $U_{i} = \frac{c_{i}}{\sum\limits_{i = 2}^{I}c_{i}}$ for i=1, 2, . . . , I, where C_(i) is value calculated according to a function $C_{i} = {\frac{1}{\frac{R_{i}}{\sum\limits_{i = 2}^{I}R_{i}}}.}$
 4. The method of claim 1, said identifying paths P_(i) further comprising: storing in a repository located on said first provider edge said identified paths P_(i) for i=1, 2, . . . , I.
 5. The method of claim 1, said method further comprising: storing in a repository said jitter J_(i) for i=1, 2, . . . , I and said packet delay D_(i) for i=1, 2, . . . , I and said packet loss L_(i) for i=1, 2, . . . , I and said path usage U_(i) for i=1, 2, . . . , I.
 6. A computer program product, comprising a computer-usable storage medium having a computer-readable program code stored therein, said computer-readable program code containing instructions that when executed by a processor of a computer system implement a method for implementing adaptive load sharing to balance network traffic, said method comprising: identifying paths P_(i) for i=1, 2, . . . , I, each path P_(i) beginning at a first provider edge and ending at a second provider edge, both said first provider edge and said second provider edge residing in a network, said index I being a total number of paths in said network and being a positive integer greater than 1; identifying jitter J_(i) for i=1, 2, . . . , I where J_(i) corresponds to jitter on path P_(i), said jitter Ji being a measurement of time; identifying packet delay D_(i) for i=1, 2, . . . , I where D_(i) is a packet delay on path P_(i), said packet delay Di being a measurement of time; identifying packet loss L_(i) for i=1, 2, . . . , I where L_(i) is a packet loss on path P_(i), said packet loss Li being an integer having a value greater than zero; calculating path usage U_(i) for i=1, 2, . . . , I where U_(i) is a maximum percentage of network traffic path P_(i) may transmit, said U_(i) being a function of said J_(i) and said D_(i) and said L_(i); and sending data received by said first provider edge to said second provider edge via path P_(i) where path P_(i) has both a largest path usage U_(i) value selected from U₁, U₂, . . . , U_(I) and said path P_(i) does not already transmit a percentage of network traffic equal to said U_(i).
 7. The computer program product of claim 6, said method further comprising: repeating said identifying said packet delay D_(i) for i=1, 2, . . . , I and said identifying said jitter J_(i) for i=1, 2, . . . , I and said identifying said packet loss L_(i) for i=1, 2, . . . , I and said calculating said path usage U_(i) for i=1, 2, . . . , I, after a period of time having elapsed.
 8. The computer program product of claim 6, said calculating said path usage U_(i) comprising: calculating a path rate R_(i) according to a function R_(i)=D_(i)*DN+J_(i)*JN+L_(g)*LN for i=1, 2, . . . , I, said DN being a delay ratio and being an integer having a value greater than 1, said JN being a jitter ratio and being an integer having a value greater than 1, said LN being a packet loss ratio per ten million packets and being an integer having a value greater than 1, said DN and said JN and said LN being provided by an end user prior to said calculating said path usage U_(i), and calculating said path usage U_(i) according to a function $U_{i} = \frac{c_{i}}{\sum\limits_{i = 1}^{I}c_{i}}$ for i=1, 2, . . . , I, where C_(i) is value calculated according to a function $C_{i} = {\frac{1}{\frac{R_{i}}{\sum\limits_{i = 2}^{I}R_{i}}}.}$
 9. The computer program product of claim 6, said identifying paths P_(i) further comprising: storing in a repository located on said first provider edge said identified paths P_(i) for i=1, 2, . . . , I.
 10. The computer program product of claim 6, said method further comprising: storing in a repository said jitter J_(i) for i=1, 2, . . . , I and said packet delay D_(i) for i=1, 2, . . . , I and said packet loss L_(i) for i=1, 2, . . . , I and said path usage U_(i) for i=1, 2, . . . , I.
 11. A computing system comprising a processor coupled to a computer-readable memory unit, said memory unit comprising a software application, said software application comprising instruction that when executed by said processor, implement a method for implementing adaptive load sharing to balance network traffic, said method comprising: identifying paths P_(i) for i=1, 2, . . . , I, each path P_(i) beginning at a first provider edge and ending at a second provider edge, both said first provider edge and said second provider edge residing in a network, said index I being a total number of paths in said network and being a positive integer greater than 1; identifying jitter J_(i) for i=1, 2, . . . , I where J_(i) corresponds to jitter on path P_(i), said jitter Ji being a measurement of time; identifying packet delay D_(i) for i=1, 2, . . . , I where D_(i) is a packet delay on path P_(i), said packet delay Di being a measurement of time; identifying packet loss L_(i) for i=1, 2, . . . , I where L_(i) is a packet loss on path P_(i), said packet loss Li being an integer having a value greater than zero; calculating path usage U_(i) for i=1, 2, . . . , I where U_(i) is a maximum percentage of network traffic path P_(i) may transmit, said U_(i) being a function of said J_(i) and said D_(i) and said L_(i); and sending data received by said first provider edge to said second provider edge via path P_(i) where path P_(i) has both a largest path usage U_(i) value selected from U₁, U₂, . . . , U_(I) and said path P_(i) does not already transmit a percentage of network traffic equal to said U_(i).
 12. The computing system of claim 11, said method further comprising: repeating said identifying said packet delay D_(i) for i=1, 2, . . . , I and said identifying said jitter J_(i) for i=1, 2, . . . , I and said identifying said packet loss L_(i) for i=1, 2, . . . , I and said calculating said path usage U_(i) for i=1, 2, . . . , I, after a period of time having elapsed.
 13. The computing system of claim 11, said calculating said path usage U_(i) comprising: calculating a path rate R_(i) according to a function R_(i)=D_(i)*DN+J_(i)*JN+L_(g)*LN for i=1, 2, . . . , I, said DN being a delay ratio and being an integer having a value greater than 1, said JN being a jitter ratio and being an integer having a value greater than 1, said LN being a packet loss ratio per ten million packets and being an integer having a value greater than 1, said DN and said JN and said LN being provided by an end user prior to said calculating said path usage U_(i), and calculating said path usage U_(i) according to a function $U_{i} = \frac{c_{i}}{\sum\limits_{i = 1}^{I}c_{i}}$ for i=1, 2, . . . , I, where C_(i) is value calculated according to a function $C_{i} = {\frac{1}{\frac{R_{i}}{\sum\limits_{i = 2}^{I}R_{i}}}.}$
 14. The computing system of claim 11, said identifying paths P_(i) further comprising: storing in a repository located on said first provider edge said identified paths P_(i) for i=1, 2, . . . , I.
 15. The computing system of claim 11, said method further comprising: storing in a repository said jitter J_(i) for i=1, 2, . . . , I and said packet delay D_(i) for i=1, 2, . . . , I and said packet loss L_(i) for i=1, 2, . . . , I and said path usage U_(i) for i=1, 2, . . . , I.
 16. A process for supporting computer infrastructure, said process comprising providing at least one support service for at least one of creating, integrating, hosting, maintaining, and deploying computer-readable code in a computing system, wherein said code in combination with the computing system is capable of implementing a method for implementing adaptive load sharing to balance network traffic, said method comprising: identifying paths P_(i) for i=1, 2, . . . , I, each path P_(i) beginning at a first provider edge and ending at a second provider edge, both said first provider edge and said second provider edge residing in a network, said index I being a total number of paths in said network and being a positive integer greater than 1; identifying jitter J_(i) for i=1, 2, . . . , I where J_(i) corresponds to jitter on path P_(i), said jitter Ji being a measurement of time; identifying packet delay D_(i) for i=1, 2, . . . , I where D_(i) is a packet delay on path P_(i), said packet delay Di being a measurement of time; identifying packet loss L_(i) for i=1, 2, . . . , I where L_(i) is a packet loss on path P_(i), said packet loss Li being an integer having a value greater than zero; calculating path usage U_(i) for i=1, 2, . . . , I where U_(i) is a maximum percentage of network traffic path P_(i) may transmit, said U_(i) being a function of said J_(i) and said D_(i) and said L_(i); and sending data received by said first provider edge to said second provider edge via path P_(i) where path P_(i) has both a largest path usage U_(i) value selected from U₁, U₂, . . . , U_(I) and said path P_(i) does not already transmit a percentage of network traffic equal to said U_(i).
 17. The process for supporting computer infrastructure of claim 16, said method further comprising: repeating said identifying said packet delay D_(i) for i=1, 2, . . . , I and said identifying said jitter J_(i) for i=1, 2, . . . , I and said identifying said packet loss L_(i) for i=1, 2, . . . , I and said calculating said path usage U_(i) for i=1, 2, . . . , I, after a period of time having elapsed.
 18. The process for supporting computer infrastructure of claim 16, said calculating said path usage U_(i) comprising: calculating a path rate R_(i) according to a function R_(i)=D_(i)*DN+J_(i)*JN+L_(g)*LN for i=1, 2, . . . , I, said DN being a delay ratio and being an integer having a value greater than 1, said JN being a jitter ratio and being an integer having a value greater than 1, said LN being a packet loss ratio per ten million packets and being an integer having a value greater than 1, said DN and said JN and said LN being provided by an end user prior to said calculating said path usage U_(i), and calculating said path usage U_(i) according to a function $U_{i} = \frac{c_{i}}{\sum\limits_{i = 2}^{I}c_{i}}$ for i=1, 2, . . . , I, where C_(i) is value calculated according to a function $C_{i} = {\frac{1}{\frac{R_{i}}{\sum\limits_{i = 2}^{I}R_{i}}}.}$
 19. The process for supporting computer infrastructure of claim 16, said identifying paths P_(i) further comprising: storing in a repository located on said first provider edge said identified paths P_(i) for i=1, 2, . . . , I.
 20. The process for supporting computer infrastructure of claim 16, said method further comprising: storing in a repository said jitter J_(i) for i=1, 2, . . . , I and said packet delay D_(i) for i=1, 2, . . . , I and said packet loss L_(i) for i=1, 2, . . . , I and said path usage U_(i) for i=1, 2, . . . , I. 